On random stable partitions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey on Simulating Stable Random Variables

In general case, Chambers et al. (1976) introduced the following algorithm for simulating any stable random variables $ X/sim(alpha, beta, gamma, delta) $ with four parameters. They use a nonlinear transformation of two independent uniform random variables for simulating an stable random variable... (to continue, click here)

متن کامل

On stable embeddability of partitions

Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, raise in the quantum computation, bin-packing and matrix analysis. We find the implications between these partial orders. For integral partitions whose entries are all powers of a fixed number p, we show that the embeddability is completel...

متن کامل

Random Walks on Strict Partitions

We consider a certain sequence of random walks. The state space of the nth random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to a continuous-time Markov process. The state space of this process is the infinite-dimensional simplex consisting of all nonincreasing infinite sequences of n...

متن کامل

Random walks on random partitions in one dimension.

Random walks on state space partitions provide an abstract generic picture for the description of macroscopic uctuations in heterogeneous systems like proteins. We determine the average residence probability and the average distribution of residence times in a particular macroscopic state for the ensemble of random partitions of a one-dimensional state space. In particular, the probability that...

متن کامل

Increments of Random Partitions

For any partition of {1, 2, . . . , n} we define its increments Xi, 1 ≤ i ≤ n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We prove that for partially exchangeable random partitions (where the probability of a partition depends only on its block sizes in order of appearance), the law of the increments uniquely determines the law of the partit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Game Theory

سال: 2018

ISSN: 0020-7276,1432-1270

DOI: 10.1007/s00182-018-0635-9